Maximal Projective Degrees for Strict Partitions
نویسندگان
چکیده
Let λ be a partition, and denote by f λ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing f λ was determined in the classical work of Logan and Shepp and, independently, of Vershik and Kerov. The analogue problem, where the number of parts of λ is bounded by a fixed number, was done by Askey and Regev – though some steps in this work were assumed without a proof. Here these steps are proved rigorously. When λ is strict, we denote by gλ the number of standard tableau of shifted shape λ. We determine the partition λ maximizing gλ in the strip. In addition we give a conjecture related to the maximizing of gλ without any length restrictions.
منابع مشابه
Strict Partitions of Maximal Projective Degree
The projective degrees of strict partitions of n were computed for all n ≤ 100 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n “lie close to each other” in a certain sense. Conjecturing that this holds for larger values of n, the partitions of maximal degree were computed for all n ≤ 220. The results ...
متن کاملLarge deviations for integer partitions
We consider deviations from limit shape induced by uniformly distributed partitions (and strict partitions) of an integer n on the associated Young diagrams. We prove a full large deviation principle, of speed p n. The proof, based on projective limits, uses the representation of the uniform measure on partitions by means of suitably conditioned independent variables.
متن کاملProjective maximal submodules of extending regular modules
We show that a projective maximal submodule of afinitely generated, regular, extending module is a directsummand. Hence, every finitely generated, regular, extendingmodule with projective maximal submodules is semisimple. As aconsequence, we observe that every regular, hereditary, extendingmodule is semisimple. This generalizes and simplifies a result of Dung and Smith. As another consequen...
متن کاملRandom Strict Partitions and Determinantal Point Pro- Cesses
We present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2, . . . } or on the open half-line (0,+∞). The main result is the computation of the correlation kernels. They have integrable form and are expressed through the Euler gamma function (the lattice case) and the classical Whittaker functions (the continuous case). Ou...
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007